Deflating Quadratic Matrix Polynomials with Structure Preserving Transformations
نویسندگان
چکیده
Given a pair of distinct eigenvalues (λ1, λ2) of an n×n quadratic matrix polynomial Q(λ) with nonsingular leading coefficient and their corresponding eigenvectors, we show how to transform Q(λ) into a quadratic of the form [ Qd(λ) 0 0 q(λ) ] having the same eigenvalues as Q(λ), with Qd(λ) an (n− 1)× (n− 1) quadratic matrix polynomial and q(λ) a scalar quadratic polynomial with roots λ1 and λ2. This block diagonalization cannot be achieved by a similarity transformation applied directly to Q(λ) unless the eigenvectors corresponding to λ1 and λ2 are parallel. We identify conditions under which we can construct a family of 2n × 2n elementary similarity transformations that (a) are rank-two modifications of the identity matrix, (b) act on linearizations of Q(λ), (c) preserve the block structure of a large class of block symmetric linearizations of Q(λ), thereby defining new quadratic matrix polynomials Q1(λ) that have the same eigenvalues as Q(λ), (d) yield quadratics Q1(λ) with the property that their eigenvectors associated with λ1 and λ2 are parallel and hence can subsequently be deflated by a similarity applied directly to Q1(λ). This is the first attempt at building elementary transformations that preserve the block structure of widely used linearizations and which have a specific action.
منابع مشابه
Numerical Computation of Deflating Subspaces of Skew-Hamiltonian/Hamiltonian Pencils
We discuss the numerical solution of structured generalized eigenvalue problems that arise from linear-quadratic optimal control problems, H∞ optimization, multibody systems, and many other areas of applied mathematics, physics, and chemistry. The classical approach for these problems requires computing invariant and deflating subspaces of matrices and matrix pencils with Hamiltonian and/or ske...
متن کاملNumerical Methods for Linear Quadratic and H∞ Control Problems
We discuss the numerical solution of linear quadratic optimal control problems and H∞ control problems. A standard approach for these problems leads to solving algebraic Riccati equations or to the computation of deflating subspaces of structured matrix pencils. New structure preserving methods for these problems have been developed recently. These are faster than the conventional used methods ...
متن کاملSymplectic, BVD, and Palindromic Approaches to Discrete-Time Control Problems¶
We give several different formulations for the discrete-time linear-quadratic control problem in terms of structured eigenvalue problems, and discuss the relationships among the associated structured objects: symplectic matrices and pencils, BVD-pencils and polynomials, and the recently introduced classes of palindromic pencils and matrix polynomials. We show how these structured objects can be...
متن کاملStructured Eigenvalue Backward Errors of Matrix Pencils and Polynomials with Palindromic Structures
We derive formulas for the backward error of an approximate eigenvalue of a ∗palindromic matrix polynomial with respect to ∗-palindromic perturbations. Such formulas are also obtained for complex T -palindromic pencils and quadratic polynomials. When the T -palindromic polynomial is real, then we derive the backward error of a real number considered as an approximate eigenvalue of the matrix po...
متن کاملNumerical Solution of Eigenvalue Problems for Alternating Matrix Polynomials and Their Application in Control Problems for Descriptor Systems
Numerical methods for eigenvalue problems associated to alternating matrix pencils and polynomials are discussed. These problems arise in a large number of control applications for differential-algebraic equations ranging from regular and singular linear-quadratic optimal and robust control to dissipativity checking. We present a survey of several of these applications and give a systematic ove...
متن کامل